Minimax Probability Machine
نویسندگان
چکیده
When constructing a classifier, the probability of correct classification of future data points should be maximized. In the current paper this desideratum is translated in a very direct way into an optimization problem, which is solved using methods from convex optimization. We also show how to exploit Mercer kernels in this setting to obtain nonlinear decision boundaries. A worst-case bound on the probability of misclassification of future data is obtained explicitly.
منابع مشابه
On the Minimax Optimality of Block Thresholded Wavelets Estimators for ?-Mixing Process
We propose a wavelet based regression function estimator for the estimation of the regression function for a sequence of ?-missing random variables with a common one-dimensional probability density function. Some asymptotic properties of the proposed estimator based on block thresholding are investigated. It is found that the estimators achieve optimal minimax convergence rates over large class...
متن کاملMinimax Distribution Estimation in Wasserstein Distance
The Wasserstein metric is an important measure of distance between probability distributions, with several applications in machine learning, statistics, probability theory, and data analysis. In this paper, we upper and lower bound minimax rates for the problem of estimating a probability distribution underWasserstein loss, in terms of metric properties, such as covering and packing numbers, of...
متن کاملFace Recognition Based on Optimal Kernel Minimax Probability Machine
Face recognition has received extensive attention due to its potential applications in many fields. To effectively deal with this problem, a novel face recognition algorithm is proposed by using the optimal kernel minimax probability machine. The key idea of the algorithm is as follows: First, the discriminative facial features are extracted with local fisher discriminant analysis (LFDA). Then,...
متن کاملA Formulation for Minimax Probability Machine Regression
We formulate the regression problem as one of maximizing the minimum probability, symbolized by Ω, that future predicted outputs of the regression model will be within some ±ε bound of the true regression function. Our formulation is unique in that we obtain a direct estimate of this lower probability bound Ω. The proposed framework, minimax probability machine regression (MPMR), is based on th...
متن کاملRobust Minimax Probability Machine Regression Robust Minimax Probability Machine Regression
We formulate regression as maximizing the minimum probability (Ω) that the true regression function is within ±2 of the regression model. Our framework starts by posing regression as a binary classification problem, such that a solution to this single classification problem directly solves the original regression problem. Minimax probability machine classification (Lanckriet et al., 2002a) is u...
متن کاملA novel minimax probability machine for network traffic prediction
Network traffic prediction is important to network planning, performance evaluation and network management directly. A variety of machine learning models such as artificial neural networks (ANN) and support vector machine (SVM) have been applied in traffic prediction. In this paper, a novel network traffic one-step-ahead prediction technique is proposed based on a state-ofthe-art learning model...
متن کامل